Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries
نویسندگان
چکیده
منابع مشابه
The Vehicle Routing Problem with Divisible Deliveries and Pickups
If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Nagy, Gábor and Wassan, Niaz A. and Speranza, M. Grazia and Archetti, Claudia (2015) The Vehicle Routing Problem with Divisible Deliveries and Pickups. Transportation Science . pp. 271-294. ISSN 0041-...
متن کاملVehicle Routing Problem: Simultaneous Deliveries and Pickups with Split Loads and Time Windows
The Vehicle Routing Problem with Simultaneous Deliveries and Pickups (VRPSDP) has attracted great interest in research due to its potential cost savings to transportation and logistics operators. There exist several extensions of VRPSDP, and among these extensions, Simultaneous Deliveries and Pickups with Split Loads Problem (SDPSLP) is particularly proposed for eliminating the vehicle capacity...
متن کاملA Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting
Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...
متن کاملHeuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
The Vehicle Routing Problem with Pickups and Deliveries (VRPPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods. We do not make the assumption common in the VRPPD literature, that goods may only be picked up after all deliveries have been completed. We also eschew the concept of insertion and propose a method that treats pickups an...
متن کاملA branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows
In the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows, the set of customers is the union of delivery customers and pickup customers. A fleet of identical capacitated vehicles based at the depot must perform all deliveries and profitable pickups while respecting time windows. The objective is to minimize routing costs, minus the revenue associated with the pickups. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2021
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2021.04.027